Hypergraphs with large transversal number
نویسندگان
چکیده
منابع مشابه
Transversal Partitioning in Balanced Hypergraphs
A transversal of a hypergraph is a set of vertices meeting all the hyperedges. A k-fold transversal of a hypergraph is a set of vertices such that every hyperedge has at least k elements of. In this paper, we prove that a k-fold transversal of a balanced hypergraph can be expressed as a union of k pairwise disjoint transversals and such partition can be obtained in polynomial time. We give an N...
متن کاملTransversal numbers of uniform hypergraphs
The transversal number ~(H) of a hypergraph H is the minimum eardinality of a set of vertices that intersects all edges of H. For k ~ 1 define ck = supz(H)/(ra + n), where H ranges over all k-uniform hypergraphs with n vertices and m edges. Applying probabilistic arguments we show that ck = (1 + o ( 1 ) ) ~ , r . This settles a problem of Tuza. t ~
متن کاملA Note on Intersecting Hypergraphs with Large Cover Number
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r − 4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r.
متن کاملColorings of hypergraphs with large number of colors
The paper deals with the well-known problem of Erdős and Hajnal concerning colorings of uniform hypergraphs and some related questions. Let m(n, r) denote the minimum possible number of edges in an n-uniform non-r-colorable hypergraph. We show that for r > n, c1 n lnn m(n, r) rn C1 n lnn, where c1, C1 > 0 are some absolute constants.
متن کاملEquality of domination and transversal numbers in hypergraphs
The domination number γ(H) and the transversal number τ(H) (also called vertex covering number) of a hypergraph H are defined analogously to those of a graph. A hypergraph is of rank k if each edge contains at most k vertices. The inequality τ(H) ≥ γ(H) is valid for every hypergraph H without isolated vertices. We study the structure of hypergraphs satisfying τ(H) = γ(H), moreover prove that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.01.012